Sharing Supermodular Costs
نویسندگان
چکیده
منابع مشابه
Sharing Supermodular Costs
We study cooperative games with supermodular costs. We show that supermodular costs arise in a variety of situations; in particular, we show that the problem of minimizing a linear function over a supermodular polyhedron—a problem that often arises in combinatorial optimization—has supermodular optimal costs. In addition, we examine the computational complexity of the least core and least core ...
متن کاملEncouraging Cooperation in Sharing Supermodular Costs
Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a fair manner. For example, a set of agents may agree to process their jobs together on a machine, and share the optimal cost of scheduling these jobs. This kind of situation can be modelled naturally as a cooperative game. In th...
متن کاملSupermodular Games
These notes develop the theory of supermodular games. Supermodular games are those characterized by “strategic complementarities” – roughly, this means that when one player takes a higher action, the others want to do the same. Supermodular games are interesting for several reasons. First, they encompass many applied models. Second, they have the remarkable property that many solution concepts ...
متن کاملElectric-vehicle car-sharing in one-way car-sharing systems considering depreciation costs of vehicles and chargers
In recent years, car-sharing systems have been announced as a way to increase mobility and to decrease the number of single-occupant vehicles, congestion, and air pollution in many parts of the world. This study presents a linear programming model to optimize one-way car-sharing systems for electric cars considering the depreciation costs of chargers and vehicles as well as relocation cost of v...
متن کاملApproximating the least core value and least core of cooperative games with supermodular costs
We study the approximation of the least core value and the least core of supermodular cost cooperative games. We provide a framework for approximation based on oracles that approximately determine maximally violated constraints. This framework yields a 3-approximation algorithm for computing the least core value of supermodular cost cooperative games, and a polynomial-time algorithm for computi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2010
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1100.0841